List Decoding of Polar Codes
نویسندگان
چکیده
منابع مشابه
Capacity-Achievability of Polar Codes under Successive Cancellation List Decoding
Polar codes under successive cancellation decoding proposed by Ar{\i}kan provably achieve the symmetric capacity of any given binary-input discrete memoryless channel. The successive cancellation list decoder for polar codes was described by Tal and Vardy as a generalization of the successive cancellation decoder of Ar{\i}kan. The performance of the successive cancellation list decoder is encou...
متن کاملHardware Architecture for List SC Decoding of Polar Codes
We present a hardware architecture and algorithmic improvements for list SC decoding of polar codes. More specifically, we show how to completely avoid copying of the likelihoods, which is algorithmically the most cumbersome part of list SC decoding. The hardware architecture was synthesized for a blocklength of N = 1024 bits and list sizes L = 2, 4 using a UMC 90nm VLSI technology. The resulti...
متن کاملList-Decoding Multiplicity Codes
We study the list-decodability of multiplicity codes. These codes, which are based on evaluations of high-degree polynomials and their derivatives, have rate approaching 1 while simultaneously allowing for sublinear-time error-correction. In this paper, we show that multiplicity codes also admit powerful list-decoding and local list-decoding algorithms correcting a large fraction of errors. Sta...
متن کاملList decoding of binary codes
We briefly survey some recent progress on list decoding algorithms for binary codes. The results discussed include: – Algorithms to list decode binary Reed-Muller codes of any order up to the minimum distance, generalizing the classical GoldreichLevin algorithm for RM codes of order 1 (Hadamard codes). These algorithms are “local” and run in time polynomial in the message length. – Construction...
متن کاملList Decoding of Subspace Codes
Codes constructed as subsets of the projective geometry of a vector space over a finite field have recently been shown to have applications as unconditionally secure authentication codes and random network error correcting codes. If the dimension of each codeword is restricted to a fixed integer, the code forms a subset of a finite-field Grassmannian, or equivalently, a subset of the vertices o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2015
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2015.2410251